def gcd_recur(a, b):
    """
    求最大公约数
    :param a:
    :param b:
    :return:
    """
    if b == 0:
        return a

    return gcd(b, a % b)


def gcd(a, b):
    if b == 0:
        return a

    while b:
        a, b = b, a % b

    return a


if __name__ == "__main__":
    print(gcd(60, 45))
    # 最大公倍数 = (a*b)/gcd(a,b)
